Constructive Decomposition of Functions of Finite Central Mean Oscillation
نویسنده
چکیده
The space CMO of functions of finite central mean oscillation is an analogue of BMO where the condition that the sharp maximal function is bounded is replaced by the convergence of the sharp function at the origin. In this paper it is shown that each element of CMO is a singular integral image of an element of the Beurling space B2 of functions whose Hardy-Littlewood maximal function converges at zero. This result is an analogue of Uchiyama’s constructive decomposition of BMO in terms of singular integral images of bounded functions. The argument shows, in fact, that to each element of CMO one can construct a vector Calderón-Zygmund operator that maps that element into the proper subspace B2.
منابع مشابه
Mixed finite element formulation enriched by Adomian method for vibration analysis of horizontally curved beams
Abstract: The vibration analysis of horizontally curved beams is generally led to higher order shape functions using direct finite element method, resulting in more time-consuming computation process. In this paper, the weak-form mixed finite element method was used to reduce the order of shape functions. The shape functions were first considered linear which did not provide adequate accuracy....
متن کاملConstructive Decomposition of Functions of Two Variables Using Functions of One Variable
Given a compact set K in the plane, which contains no triple of points forming a vertical and a horizontal segment, and a map f ∈ C(K), we give a construction of functions g, h ∈ C(R) such that f(x, y) = g(x)+h(y) for all (x, y) ∈ K. This provides a constructive proof of a part of Sternfeld’s theorem on basic embeddings in the plane. In the proof we construct a sequence of finite graphs, which ...
متن کاملConstructive Decomposition of a Function of Two Variables as a Sum of Functions of One Variable
Given a compact set K in the plane, which does not contain any triple of points forming a vertical and a horizontal segment, and a map f ∈ C(K), we give a construction of functions g, h ∈ C(R) such that f(x, y) = g(x) + h(y) for all (x, y) ∈ K. This provides a constructive proof of a part of Sternfeld’s theorem on basic embeddings in the plane. In our proof the set K is approximated by a finite...
متن کاملUpdating finite element model using frequency domain decomposition method and bees algorithm
The following study deals with the updating the finite element model of structures using the operational modal analysis. The updating process uses an evolutionary optimization algorithm, namely bees algorithm which applies instinctive behavior of honeybees for finding food sources. To determine the uncertain updated parameters such as geometry and material properties of the structure, local and...
متن کاملSolving Differential Equations by Using a Combination of the First Kind Chebyshev Polynomials and Adomian Decomposition Method
In this paper, we are going to solve a class of ordinary differential equations that its source term are rational functions. We obtain the best approximation of source term by Chebyshev polynomials of the first kind, then we solve the ordinary differential equations by using the Adomian decomposition method
متن کامل